Permutation group algorithms / A. Seress |
Autore | Seress, Akos <1958- > |
Pubbl/distr/stampa | Cambridge : Cambridge University, c2003 |
Descrizione fisica | ix, 264 p. ; 24 cm |
Disciplina | 512.2 |
Collana | Cambridge tracts in mathematics |
Soggetto non controllato |
Algoritmi
Gruppi di permutazione |
ISBN | 0-521-66103-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-990003984900403321 |
Seress, Akos <1958- > | ||
Cambridge : Cambridge University, c2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Permutation group algorithms / Akos Seress |
Autore | Seress, Akos |
Pubbl/distr/stampa | Cambridge, : Cambridge university, 2003 |
Descrizione fisica | IX, 264 p. ; 24 cm. |
Soggetto topico |
20-XX - Group theory and generalizations [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68W40 - Analysis of algorithms [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 20-08 - Computational methods for problems pertaining to group theory [MSC 2020] |
ISBN | 978-05-216-6103-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAMPANIA-SUN0051399 |
Seress, Akos | ||
Cambridge, : Cambridge university, 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Permutation group algorithms / / Ákos Seress [[electronic resource]] |
Autore | Seress Ákos <1958-> |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2003 |
Descrizione fisica | 1 online resource (ix, 264 pages) : digital, PDF file(s) |
Disciplina | 512/.2 |
Collana | Cambridge tracts in mathematics |
Soggetto topico |
Permutation groups
Algorithms |
ISBN |
1-107-12840-4
1-280-41763-3 9786610417636 1-139-14616-5 0-511-16962-0 0-511-06647-3 0-511-06016-5 0-511-30845-0 0-511-54654-8 0-511-06860-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups. |
Record Nr. | UNINA-9910450522603321 |
Seress Ákos <1958-> | ||
Cambridge : , : Cambridge University Press, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Permutation group algorithms / Akos Seress |
Autore | Seress, Akos |
Pubbl/distr/stampa | Cambridge, : Cambridge university, 2003 |
Descrizione fisica | IX, 264 p. ; 24 cm |
Soggetto topico |
20-XX - Group theory and generalizations [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68W40 - Analysis of algorithms [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 20-08 - Computational methods for problems pertaining to group theory [MSC 2020] |
ISBN | 978-05-216-6103-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNICAMPANIA-VAN0051399 |
Seress, Akos | ||
Cambridge, : Cambridge university, 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Vanvitelli | ||
|
Permutation group algorithms / / Ákos Seress [[electronic resource]] |
Autore | Seress Ákos <1958-> |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2003 |
Descrizione fisica | 1 online resource (ix, 264 pages) : digital, PDF file(s) |
Disciplina | 512/.2 |
Collana | Cambridge tracts in mathematics |
Soggetto topico |
Permutation groups
Algorithms |
ISBN |
1-107-12840-4
1-280-41763-3 9786610417636 1-139-14616-5 0-511-16962-0 0-511-06647-3 0-511-06016-5 0-511-30845-0 0-511-54654-8 0-511-06860-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups. |
Record Nr. | UNINA-9910783285203321 |
Seress Ákos <1958-> | ||
Cambridge : , : Cambridge University Press, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Permutation group algorithms / / Ákos Seress [[electronic resource]] |
Autore | Seress Ákos <1958-> |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2003 |
Descrizione fisica | 1 online resource (ix, 264 pages) : digital, PDF file(s) |
Disciplina | 512/.2 |
Collana | Cambridge tracts in mathematics |
Soggetto topico |
Permutation groups
Algorithms |
ISBN |
1-107-12840-4
1-280-41763-3 9786610417636 1-139-14616-5 0-511-16962-0 0-511-06647-3 0-511-06016-5 0-511-30845-0 0-511-54654-8 0-511-06860-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups. |
Record Nr. | UNINA-9910811824603321 |
Seress Ákos <1958-> | ||
Cambridge : , : Cambridge University Press, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|